New bounds on a hypercube coloring problem
نویسندگان
چکیده
منابع مشابه
New bounds on a hypercube coloring problem
In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices whose Hamming distance is at most k are colored differently. Determining the exact value of χk̄(n), the minimum number of colors needed, appears to be a difficult problem. In this note, we improve the known lower and uppe...
متن کاملNew Bounds on a Hypercube Coloring Problem and Linear Codes
In studying the scalability of optical networks, one problem arising involves coloring the vertices of the dimensional hypercube with as few colors as possible such that any two vertices whose Hamming distance is at most are colored differently. Determining the exact value of , the minimum number of colors needed, appears to be a difficult problem. In this paper, we improve the known lower and ...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملNew Bounds for Hypercube Slicing Numbers
What is the maximum number of edges of the d-dimensional hypercube, denoted by S d k , that can be sliced by k hyperplanes? This question on combinatorial properties of Euclidean geometry arising from linear separability considerations in the theory of Perceptrons has become an issue on its own. We use computational and combinatorial methods to obtain new bounds for S d k , d 8. These strengthe...
متن کاملa new simulated annealing algorithm for the robust coloring problem
the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2002
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(02)00301-0